Randomized fully dynamic graph algorithms with polylogarithmic time per operation
نویسندگان
چکیده
منابع مشابه
Fully Dynamic 2-Edge Connectivity Algorithm in Polylogarithmic Time per Operation
This paper presents the first dynamic algorithm that maintains 2-edge connectivity in polylogarithmic time per operation. The algorithm is a Las-Vegas type randomized algorithm. The expected time for p = (m0 + n) insertions or deletions of edges is O(p log n), where m0 is the number of edges in the initial graph with n nodes. The worst-case time for a query is O(log n). If only deletions are a...
متن کاملFully Dynamic Delauney Triangulation in Logarithmic Expected Time per Operation
The Delaunay Tree is a hierarchical data structure that has been introduced in [7] and analyzed in [6, 4]. For a given set of sites S in the plane and an order of insertion for these sites, the Delaunay Tree stores all the successive Delaunay triangulations. As proved before, the Delaunay Tree allows the insertion of a site in logarithmic expected time and linear expected space, when the insert...
متن کاملDynamic graph connectivity in polylogarithmic worst case time
The dynamic graph connectivity problem is the following: given a graph on a fixed set of n nodes which is undergoing a sequence of edge insertions and deletions, answer queries of the form q(a, b): “Is there a path between nodes a and b?” While data structures for this problem with polylogarithmic amortized time per operation have been known since the mid-1990’s, these data structures have Θ(n)...
متن کاملFully Dynamic 2-Edge Connectivity Algorithm in Polygarithmic Time per Operation
This paper presents the first dynamic algorithm that maintains 2-edge connectivity in polylogarithmic time per operation. The algorithm is a Las-Vegas type randomized algorithm. The expected time for p = (m0 + n) insertions or deletions of edges is O(p log n), where m0 is the number of edges in the initial graph with n nodes. The worst-case time for a query is O(log n). If only deletions are a...
متن کاملFully Dynamic Randomized Algorithms for Graph Spanners in Centralized as well as Distributed environments∗
Spanner of an undirected graph G = (V, E) is a sub graph which is sparse and yet preserves all-pairs distances approximately. More formally, a spanner with stretch t ∈ N is a subgraph (V, ES), ES ⊆ E such that the distance between any two vertices in the subgraph is at most t times their distance in G. We present two randomized algorithms for maintaining a sparse t-spanner of an undirected unwe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1999
ISSN: 0004-5411,1557-735X
DOI: 10.1145/320211.320215